A distributed minimum restrictive connectivity maintenance algorithm

نویسندگان

  • Jay Wagenpfeil
  • Adrian Trachte
  • Takeshi Hatanaka
  • Masayuki Fujita
  • Oliver Sawodny
چکیده

The dynamic character of autonomous mobile multi-agent networks makes the control of the individual agent’s movement a challenging task when certain properties or conditions concerning the global network state must be fulfilled. Many distributed algorithms require that the communication topology of the regarded multi-agent network is connected at all times to execute properly. Since particularly motion control algorithms directly influence the connectivity itself, the fundamental question how connectivity of the network can be maintained is raised. As an additional difficulty, individual agents often have only access to local information, whereas connectivity is a property of the global network. In this work, a distributed hybrid connectivity maintenance algorithm is proposed, which guarantees global connectivity of the network based on local information. The algorithm is divided in two components: First, a discrete topology control algorithm determines periodically the structure of a minimum cost spanning tree on the network communication graph. Second, a continuous connectivity motion control algorithm constrains the location of each individual agent such that the determined spanning tree is preserved. This combined algorithm effectively maintains connectivity under the presence of any finite-valued primary motion control law.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS

 Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...

متن کامل

Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement

Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...

متن کامل

ساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکه‌های حسگر بی‌سیم

Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from  wireless devices with limited resources thus  to  Long-Term survival of the Network must use  energy-efficient mechanisms, algorithms and protocols. one of th...

متن کامل

Improved Distributed Algorithms for Fundamental Graph Problems

Distributed graph algorithms provide efficient and theoretically sound methods for solving graph problems in distributed settings and more generally for performing distributed computation in networks. These algorithms are applicable in a wide variety of settings, ranging from computer networks to massively parallel computing and beyond. This thesis addresses a number of the central problems of ...

متن کامل

Constructing Minimum Relay Connected Sensor Cover in Heterogeneous Wireless Sensor Networks

Energy efficiency is an important problem in wireless sensor networks. In this paper, we consider the energy efficiency problem in a heterogeneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum relayconnected sensor cover (MRCSC) problem for heterogeneous sensor networks. The purpose of this problem is to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009